A Framework for Efficient Minimum Distance Computations
نویسندگان
چکیده
In this paper we present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, including sculptured surfaces. The framework depends on geometric reasoning rather than numerical methods and can be implemented straightforwardly. We demonstrate performance that compares favorably to other polygonal methods and is faster than reported results for other methods on sculptured surfaces.
منابع مشابه
Density Estimation in Linear Time
We consider the problem of choosing a density estimate from a set of densities F , minimizing the L1-distance to an unknown distribution. Devroye and Lugosi [DL01] analyze two algorithms for the problem: Scheffé tournament winner and minimum distance estimate. The Scheffé tournament estimate requires fewer computations than the minimum distance estimate, but has strictly weaker guarantees than ...
متن کاملA Fast K-prototypes Algorithm Using Partial Distance Computation
The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as ...
متن کاملEfficient Collision and Self-Collision Detection for Humanoids Based on Sphere Tree Hierarchies
We present an algorithm for computing compact sphere tree hierarchies over general 3D polygonal meshes for the purpose of efficient collision detection and minimum distance computation. The sphere tree construction method we use optimizes the location of the sphere centers and radii at each level of the hierarchy to compactly contain the underlying geometry. We enhance the hierarchy constructio...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملRange of Motion Hull: An approach for detecting collision and self-collision for dynamic objects based on hierarchical sphere trees. Diploma Thesis
Collision Detection must choose a trade-off between approximative complexity, tightness of approximative fit, and cost of overlap test and distance computation. The collision detection system must be robust, efficient, and capable to deal with any kind of object. Therefore, hierarchical data structures are used to deal with complex objects. An algorithm for computing compact sphere tree hierarc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998